The Moore-Penrose inverse of a free matrix

نویسنده

Thomas Britz

چکیده

A matrix is free, or generic, if its nonzero entries are algebraically independent. Necessary and sufficient combinatorial conditions are presented for a complex free matrix to have a free Moore-Penrose inverse. These conditions extend previously known results for square, nonsingular free matrices. The result used to prove this characterization relates the combinatorial structure of a free matrix to that of its Moore-Penrose inverse. Also, it is proved that the bipartite graph or, equivalently, the zero pattern of a free matrix uniquely determines that of its Moore-Penrose inverse, and this mapping is described explicitly. Finally, it is proved that a free matrix contains at most as many nonzero entries as does its Moore-Penrose inverse.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Schulz-type Method to Compute the Moore-Penrose Inverse

A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.

متن کامل

Hermitian solutions to the system of operator equations T_iX=U_i.

In this article we consider the system of operator equations T_iX=U_i for i=1,2,...,n and give necessary and suffcient conditions for the existence of common Hermitian solutions to this system of operator equations for arbitrary operators without the closedness condition. Also we study the Moore-penrose inverse of a ncross 1 block operator matrix and. then gi...

متن کامل

The reverse order law for Moore-Penrose inverses of operators on Hilbert C*-modules

Suppose $T$ and $S$ are Moore-Penrose invertible operators betweenHilbert C*-module. Some necessary and sufficient conditions are given for thereverse order law $(TS)^{ dag} =S^{ dag} T^{ dag}$ to hold.In particular, we show that the equality holds if and only if $Ran(T^{*}TS) subseteq Ran(S)$ and $Ran(SS^{*}T^{*}) subseteq Ran(T^{*}),$ which was studied first by Greville [{it SIAM Rev. 8 (1966...

متن کامل

On the duality of quadratic minimization problems using pseudo inverses

‎In this paper we consider the minimization of a positive semidefinite quadratic form‎, ‎having a singular corresponding matrix $H$‎. ‎We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method‎. ‎Given this approach and based on t...

متن کامل